#include<iostream>
#include<cstdio>
#include<ctime>
#include"Sorting.h"
#include<vector>
#include<cstdlib>
using namespace std;
int main(){
    ///@brief 产生特定有序度的数组
    clock_t time_begin,time_end;
    int n = 100000;
    vector<int> a1;
    int x[4];
    int i = 3;
    x[0] = 501,x[1] = 1531,x[2] = 68377,x[3] = 90000;

    for(int j = 0; j<x[i]; j++){
        a1.push_back(j);
    }
    for(int k = x[i];k<n;k++){
        int mm = x[i] + (n - 1 - k);
        a1.push_back(mm);
    }

    // for(int i = 0; i<100000;i++){
    //     a1.push_back(i);
    // }
    ///@brief 使用堆排序和快速排序进行排序
    time_begin = clock();
    //heapsort(a1);
    quicksort(a1);
    time_end = clock();
    double total_time = (double)(time_end-time_begin)/1000;
    cout<<"排序时间是"<<total_time<<"ms"<<endl;
    
}